Klein polyhedra and lattices with positive norm minima par

نویسندگان

  • Oleg N. GERMAN
  • Oleg N. German
چکیده

A Klein polyhedron is defined as the convex hull of nonzero lattice points inside an orthant of R. It generalizes the concept of continued fraction. In this paper facets and edge stars of vertices of a Klein polyhedron are considered as multidimensional analogs of partial quotients and quantitative characteristics of these “partial quotients”, so called determinants, are defined. It is proved that the facets of all the 2 Klein polyhedra generated by a lattice Λ have uniformly bounded determinants if and only if the facets and the edge stars of the vertices of the Klein polyhedron generated by Λ and related to the positive orthant have uniformly bounded determinants.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Klein Polyhedra and Lattices with Positive Norm Minima

A Klein polyhedron is defined as the convex hull of nonzero lattice points inside an orthant of R n. It generalizes the concept of continued fraction. In this paper facets and edge stars of vertices of a Klein polyhedron are considered as multidimensional analogs of partial quotients and quantitative characteristics of these " partial quotients " , so called determinants, are defined. It is pro...

متن کامل

0 N ov 2 00 8 Distributive Lattices , Polyhedra , and Generalized Flow

AD-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full characterization of the bounding hyperplanes of D-polyhedra. Aside from being a nice combination of geometric and order theoretic concepts, Dpolyhedra are a unifying genera...

متن کامل

Distributive Lattices, Polyhedra, and Generalized Flow

AD-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full characterization of the bounding hyperplanes of D-polyhedra. Aside from being a nice combination of geometric and order theoretic concepts, Dpolyhedra are a unifying genera...

متن کامل

Distributive lattices, polyhedra, and generalized flows

AD-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full characterization of the bounding hyperplanes of D-polyhedra. Aside from being a nice combination of geometric and order theoretic concepts, Dpolyhedra are a unifying genera...

متن کامل

Grr Obner Bases of Lattices, Corner Polyhedra, and Integer Programming

There are very close connections between the arithmetic of integer lattices, algebraic properties of the associated ideals, and the geometry and the combinatorics of corresponding polyhedra. In this paper we investigate the generating sets (\Grr obner bases") of integer lattices that correspond to the Grr obner bases of the associated binomial ideals. Extending results by Sturmfels & Thomas, we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007